Recovery Analysis for Weighted ℓ1-Minimization Using a Null Space Property
نویسندگان
چکیده
We study the recovery of sparse signals from underdetermined linear measurements when a potentially erroneous support estimate is available. Our results are twofold. First, we derive necessary and sufficient conditions for signal recovery from compressively sampled measurements using weighted l1norm minimization. These conditions, which depend on the choice of weights as well as the size and accuracy of the support estimate, are on the null space of the measurement matrix. They can guarantee recovery even when standard l1 minimization fails. Second, we derive bounds on the number of Gaussian measurements for these conditions to be satisfied, i.e., for weighted l1 minimization to successfully recover all sparse signals whose support has been estimated sufficiently accurately. Our bounds show that weighted l1 minimization requires significantly fewer measurements than standard l1 minimization when the support estimate is relatively accurate.
منابع مشابه
Recovery analysis for weighted mixed $\ell_2/\ell_p$ minimization with $0<p\leq 1$
We study the recovery conditions of weighted mixed l2/lp (0 < p ≤ 1) minimization for block sparse signal reconstruction from compressed measurements when partial block support information is available. We show that the block p-restricted isometry property (RIP) can ensure the robust recovery. Moreover, we present the sufficient and necessary condition for the recovery by using weighted block p...
متن کاملExact Recovery for Sparse Signal via Weighted l_1 Minimization
Numerical experiments in literature on compressed sensing have indicated that the reweighted l1 minimization performs exceptionally well in recovering sparse signal. In this paper, we develop exact recovery conditions and algorithm for sparse signal via weighted l1 minimization from the insight of the classical NSP (null space property) and RIC (restricted isometry constant) bound. We first int...
متن کاملWeighted sparse recovery with expanders
We derived the first sparse recovery guarantees for weighted l1 minimization with sparse random matrices and the class of weighted sparse signals, using a weighted versions of the null space property to derive these guarantees. These sparse matrices from expender graphs can be applied very fast and have other better computational complexities than their dense counterparts. In addition we show t...
متن کاملPhaseless compressive sensing using partial support information
We study the recovery conditions of weighted `1 minimization for real signal reconstruction from phaseless compressed sensing measurements when partial support information is available. A Strong Restricted Isometry Property (SRIP) condition is provided to ensure the stable recovery. Moreover, we present the weighted null space property as the sufficient and necessary condition for the success o...
متن کاملA Weighted l1-Minimization for Distributed Compressive Sensing
Distributed Compressive Sensing (DCS) studies the recovery of jointly sparse signals. Compared to separate recovery, the joint recovery algorithms in DCS are usually more effective as they make use of the joint sparsity. In this thesis, we study a weighted l1-minimization algorithm for the joint sparsity model JSM-1 proposed by Baron et al. Our analysis gives a sufficient null space property fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1412.1565 شماره
صفحات -
تاریخ انتشار 2014